A statistical analysis of certain iterative learning control algorithms

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A statistical analysis of certain iterative learning control algorithms

Iterative Learning Control (ILC) is a technique used to improve the tracking performance of systems carrying out repetitive tasks, which are affected by deterministic disturbances. The achievable performance is greatly degraded, however, when non-repeating, stochastic disturbances are present. This paper aims to compare a number of different ILC algorithms, proposed to be more robust to the pre...

متن کامل

A note on causal and CITE iterative learning control algorithms

Time and frequency domain convergence properties of causal and Current Iteration Tracking Error (CITE) discrete time Iterative Learning Control (ILC) algorithms are discussed. Considering necessary and sufficient convergence conditions basic matrix properties can be utilized to show that causal as well as CITE ILC algorithms converge to zero error in only very restrictive special cases. The fre...

متن کامل

Robustness of iterative learning control – algorithms with experimental benchmarking

Iterative learning control is a technique especially developed for application to processes which are required to repeat the same operation over a finite duration. The exact sequence of operation is that the task is completed, the process is reset and then the operation is repeated. Applications are widespread among many industries, e.g. a gantry robot which is required to place items on a conv...

متن کامل

Experimental comparison of some classical iterative learning control algorithms

This letter gives an overview of classical iterative learning control algorithms. The presented algorithms are also evaluated on a commercial industrial robot from ABB. The presentation covers implicit to explicit model-based algorithms. The result from the evaluation of the algorithms is that performance can be achieved by having more system knowledge.

متن کامل

Convergence Analysis of Certain Reinforcement Learning Algorithms in Self-Play

I study the emergent behavior in the self-play of simple value function based reinforcement learning algorithms in an iterative two player general-sum game. The players are assumed to have limited knowledge of the game. Therefore learning algorithms only use information about their own choice and recieved reward histories to compute a value function based on which actions are chosen stochastica...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Control

سال: 2008

ISSN: 0020-7179,1366-5820

DOI: 10.1080/00207170701484851